Mapped Shuffled Fibonacci Languages
نویسندگان
چکیده
The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words:
منابع مشابه
An Introduction to Fibonacci: A Programming Language for Object Databases
Fibonacci is an object-oriented database programming language characterized by static and strong typing and by new mechanisms for modelling databases in terms of objects with roles, classes and associations. A brief introduction to the language is provided to present those features which are particularly suited to modelling complex databases. Examples of the use of Fibonacci are given with refe...
متن کاملNumber Theory and Formal Languages
I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in nite characteristic , automaticreal numbers, xed points of homomorphisms, automaticity, and k-regular sequences.
متن کاملFibonacci words, hyperbolic tilings and grossone
In this paper, we study the contribution of the theory of grossone to the study of infinite Fibonacci words, combining this tool with the help of a particular tiling of the hyperbolic plane : the tiling {7, 3}, called the heptagrid. With the help of the numeral system based on grossone, we obtain a richer family of infinite Fibonacci words compared with the traditional approach. ACM-class: F.2....
متن کاملRecognizing Shuffled Languages
Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can...
متن کاملCoefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers
In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers. Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.
متن کامل